A survey for solving mixed integer programming via machine learning
نویسندگان
چکیده
Machine learning (ML) has been recently introduced to solving optimization problems, especially for combinatorial (CO) tasks. In this paper, we survey the trend of leveraging ML solve mixed-integer programming problem (MIP). Theoretically, MIP is an NP-hard problem, and most CO problems can be formulated as MIP. Like other human-designed heuristic algorithms rely on good initial solutions cost a lot computational resources. Therefore, researchers consider applying machine methods since ML-enhanced approaches provide solution based typical patterns from training data. Specifically, first introduce formulation preliminaries representative traditional solvers. Then, show integration with detailed discussions related learning-based methods, which further classified into exact algorithms. Finally, propose outlook solvers, direction toward more beyond MIP, mutual embrace solvers components. We maintain list papers that utilize technologies available at https://github.com/Thinklab-SJTU/awesome-ml4co.
منابع مشابه
Solving Single Machine Sequencing to Minimize Maximum Lateness Problem Using Mixed Integer Programming
Despite existing various integer programming for sequencing problems, there is not enoughinformation about practical values of the models. This paper considers the problem of minimizing maximumlateness with release dates and presents four different mixed integer programming (MIP) models to solve thisproblem. These models have been formulated for the classical single machine problem, namely sequ...
متن کاملOptimizing Ψ-learning via Mixed Integer Programming
As a new margin-based classifier, ψ-learning shows great potential for high accuracy. However, the optimization of ψ-learning involves non-convex minimization and is very challenging to implement. In this article, we convert the optimization of ψ-learning into a mixed integer programming (MIP) problem. This enables us to utilize the state-of-art algorithm of MIP to solve ψ-learning. Moreover, t...
متن کاملMachine Learning for Integer Programming
Mixed Integer Programs (MIP) are solved exactly by tree-based branch-and-bound search. However, various components of the algorithm involve making decisions that are currently addressed heuristically. Instead, I propose to use machine learning (ML) approaches such as supervised ranking and multi-armed bandits to make better-informed, input-specific decisions during MIP branch-andbound. My thesi...
متن کاملA new approach for solving neutrosophic integer programming problems
Linear programming is one of the most important usages of operation research methods in real life, that includes of one objective function and one or several constraints which can be in the form of equality and inequality. Most of the problems in the real world are include of inconsistent and astute uncertainty, because of this reason we can’t obtain the optimal solution easily. In this paper, ...
متن کاملsolving single machine sequencing to minimize maximum lateness problem using mixed integer programming
despite existing various integer programming for sequencing problems, there is not enoughinformation about practical values of the models. this paper considers the problem of minimizing maximumlateness with release dates and presents four different mixed integer programming (mip) models to solve thisproblem. these models have been formulated for the classical single machine problem, namely sequ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neurocomputing
سال: 2023
ISSN: ['0925-2312', '1872-8286']
DOI: https://doi.org/10.1016/j.neucom.2022.11.024